On Partitioning Dynamic Adaptive Grid Hierarchies
نویسندگان
چکیده
This paper presents a computationally efficient runtime partitioning and load-balancing scheme for the Distributed Adaptive Grid Hierarchies that underlie adaptive mesh-refinement methods. The partitioning scheme yields an efficient parallel computational structure that maintains locality to reduce communications. Further, it enables dynamic re-partitioning and loadbalancing of the adaptive grid hierarchy to be performed cost-effectively. The run-time partitioning support presented has been implemented within the framework of a data-management infrastructure supporting dynamic distributed data-structures for parallel adaptive numerical techniques. This infrastructure is the foundational layer of a computational toolkit for the Binary Black-Hole NSF Grand Challenge project.
منابع مشابه
An Application-Centric Characterization of Distribution Techniques for Dynamic Adaptive Grid Hierarchies
Dynamically adaptive methods for the solution of partial differential equations that employ locally optimal approximations can yield highly advantageous ratios for cost/accuracy. Distributed implementations of these methods offer the potential for accurate solution of physically realistic models of important physical systems. These implementations however, lead to interesting challenges in dyna...
متن کاملRun-time selection of partitioning algorithms for parallel SAMR applications
Parallel structured adaptive mesh refinement methods decrease the execution time and memory requirements of partial differential equation solvers. These methods result in an adaptive and dynamic grid hierarchy that repeatedly needs to be re-partitioned and distributed over the processors. No single partitioning algorithm can consistently construct high-quality partitionings for all possible gri...
متن کاملDesign and Implementation of an Adaptive Meta-Partitioner for SAMR Grid Hierarchies
In this paper we present a pilot implementation of the Meta-Partitioner, a partitioning framework that automatically selects, configures, and invokes suitable partitioning algorithms for Structured Adaptive Mesh Refinement (SAMR) applications. Efficient use of SAMR on parallel computers requires that the dynamic grid hierarchy is repeatedly repartitioned and redistributed. The partitioning proc...
متن کاملA Meta-Partitioner for run-time selection and evaluation of multiple partitioning algorithms for SAMR grid hierarchies
Parallel structured adaptive mesh refinement (SAMR) methods increase the efficiency of the numerical solution to partial differential equations. These methods use an adaptive grid hierarchy to dynamically assign computational resources to areas with large solution errors. The grid hierarchy needs to be repeatedly repartitioned and distributed over the processors but no single partitioning algor...
متن کاملCharacterization of Domain-Based Partitioners for Parallel SAMR Applications
Dynamic adaptive mesh re nement methods for the numerical solution to partial di erential equations yield highly advantageous ratios for cost/accuracy as compared to methods based upon static uniform approximations. Distributed implementations of these techniques have the potential for enabling realistic simulations of complex systems. These implementations however, present signi cant challenge...
متن کامل